Classes of Languages Generated by the Kleene Star of a Word
نویسندگان
چکیده
In this paper, we study the lattice and the Boolean algebra, possibly closed under quotient, generated by the languages of the form u∗, where u is a word. We provide effective equational characterisations of these classes, i.e. one can decide using our descriptions whether a given regular language belongs or not to each of them.
منابع مشابه
Completeness Theorems for Pomset Languages and Concurrent Kleene Algebras
Pomsets constitute one of the most basic models of concurrency. A pomset is a generalisation of a word over an alphabet in that letters may be partially ordered rather than totally ordered. A term t using the bi-Kleene operations 0, 1,+, · , , ‖,(∗) defines a set [[t]] of pomsets in a natural way. We prove that every valid universal equality over pomset languages using these operations is a con...
متن کاملKleene modules and linear languages
A Kleene algebra (K,+, ·,∗ , 0, 1) is an idempotent semiring with an iteration ∗ as axiomatised by Kozen. We consider left semiring modules (A,+, 0, :) over Kleene algebras. We call such a left semiring module a Kleene module if each linear equation x = a + r : x has a least solution, where : is the product from K × A to A. The linear context-free languages can be viewed as a Kleene module A ov...
متن کاملState Complexity of Operations on Input-Driven Pushdown Automata
The family of deterministic input-driven pushdown automata (IDPDA; a.k.a. visibly pushdown automata, a.k.a. nested word automata) is known to be closed under reversal, concatenation and Kleene star. As shown by Alur and Madhusudan (“Visibly pushdown languages”, STOC 2004), the reversal and the Kleene star of an n-state IDPDA can be represented by an IDPDA with 2 2) states, while concatenation o...
متن کاملArithmetic Complexity, Kleene Closure, and Formal Power Series
The aim of this paper is to use formal power series techniques to study the structure of small arithmetic complexity classes such as GapNC and GapL. More precisely, we apply the Kleene closure of languages and the formal power series operations of inversion and root extraction to these complexity classes. We define a counting version of Kleene closure and show that it is intimately related to i...
متن کاملShuue Languages Are in P
In this paper we show that shuue languages are contained in one-way-NSPACE(logn) thus in P. We consider the class of shuue languages which emerges from the class of nite languages through regular operations (union, concatenation, Kleene star) and shuue operations (shuue and shuue closure). For every shuue expression E we construct a shuue automaton which accepts the language generated by E and ...
متن کامل